Characterization of Program Dependencies by Integer Programming Techniques
نویسنده
چکیده
Integer programming techniques can be used in the characterization of relations between the variables of programs. Such techniques are considered to be far too expensive to be used in an automatic optimizing tool. We show that the cost of such a technique can be balanced by the quality of the information that can be extracted. Our algorithm transforms sets of equations and constraints that are extracted, by the optimizing compiler, from programs and produces a characterization of the solution domain of the system. The result is a restricted domain of possible values for each variable as well as a set of new pertinent constraints. The system is run incrementally from the compiler. Its application domain is not limited to the computation of dependencies. In fact, it can be useful everywhere the decision of the compiler depends on the characterization of relations between variables of the program. Caract erisation des d ependances dans les programmes par des techniques de programmation sur les entiers R esum e : Les techniques de programmation sur les entiers peuvent ^ etre utilis ees dans la cract erisation des relations entre les variables enti eres des programmes , et plus particuli erement dans le calcul des d ependances. Mais on consi-d ere en g en eral que ces techniques sont trop co^ uteuses pour ^ etre int egr ees dans les outils automatiques. Nous montrons que ce co^ ut peut ^ etre justii e par la qua-lit e des relations qui peuvent ^ etre produites. Notre algorithme transforme des ensembles d' equations et de contraintes extraites par le compilateur et produit une caract erisation du domaine de solutions du syst eme. Ce r esultat contient une restriction des domaines de valeurs des variables ainsi qu'un ensemble de nou-velles contraintes plus pertinentes. Cet algorithme peut ^ etre appel e de mani ere incr ementale par le compilateur. Son domaine d'application n'est pas limit e au seul calcul des d ependances. Il se r ev ele utile partout o u un choix du compilateur d epend d'une caract erisation de relations entre des variables.timisation Characterization of program dependencies by integer programming techniques 1
منابع مشابه
Global Supply Chain Management under Carbon Emission Trading Program Using Mixed Integer Programming and Genetic Algorithm
In this paper, the transportation problem under the carbon emission trading program ismodelled by mathematical programming and genetic algorithm. Since green supply chain issuesbecome important and new legislations are taken into account, carbon emissions costs are included inthe total costs of the supply chain. The optimisation model has the ability to minimise the total costsand provides the ...
متن کاملDwarf Frankenstein is still in your memory: tiny code reuse attacks
Code reuse attacks such as return oriented programming and jump oriented programming are the most popular exploitation methods among attackers. A large number of practical and non-practical defenses are proposed that differ in their overhead, the source code requirement, detection rate and implementation dependencies. However, a usual aspect among these methods is consideration of the common be...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملOn the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the underlying finite integer program.
متن کاملPredicated Worst Case Execution Time Analysis
Knowledge about the Worst-Case Execution-Time (WCET) is of primordial importance in the validation of real-time systems. A WCET estimation must be safe and tight. Tightness in WCET estimation is highly desirable for an efficient utilisation of resources. In order to obtain accurate WCET values, more program execution-history must be accounted for. In this thesis we propose the use of Predicated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993